Formal representation and reasoning approaches in modelling cryptographic protocols

نویسنده

  • Andrei Lapets
چکیده

We survey at a very high level some examples of existing work involving the formal verification of the properties of cryptographic protocols. For the purposes of this survey, formal verification includes the use of logics, proof systems, and inductive reasoning. The goal of this survey is twofold. First, it reviews a few existing attempts found in the literature to model cryptographic protocols in order to verify their security , and identifies the decisions made by researchers attempting to apply formal modelling tools. Second, it assembles a detailed list of the features a formal modelling tool for cryptographic protocols should possess, and discusses the manner in which the formal modelling of various features of cryptographic protocols might be accomplished with such features.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving

In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...

متن کامل

Formal Testing & Algebraic Modelling Techniques for Verifying Cryptographic Protocols

Before trusting a communications security protocol with potentially critical or sensitive information, it is necessary to have some degree of assurance that the protocol fulfils its intended objectives. To provide this assurance it is necessary to use formal verification techniques, as intuitive reasoning does not satisfactorily guarantee complete freedom from protocol errors. In this paper, a ...

متن کامل

Automatic Verification of Privacy Properties in the Applied pi Calculus

We develop a formal method verification technique for cryptographic protocols. We focus on proving observational equivalences of the kind P ∼ Q, where the processes P and Q have the same structure and differ only in the choice of terms. The calculus of ProVerif, a variant of the applied pi calculus, makes some progress in this direction. We expand the scope of ProVerif, to provide reasoning abo...

متن کامل

Formal Methods for the Analysis of Authentication Protocols

In this paper, we examine current approaches and the state of the art in the application of formal methods to the analysis of cryptographic protocols. We use Meadows' classi cation of analysis techniques into four types. The Type I approach models and veri es a protocol using speci cation languages and veri cation tools not speci cally developed for the analysis of cryptographic protocols. In t...

متن کامل

Formal Methods for the Analysis of Authentication ProtocolsCITI

In this paper, we examine current approaches and the state of the art in the application of formal methods to the analysis of cryptographic protocols. We use Meadows' classi cation of analysis techniques into four types. The Type I approach models and veri es a protocol using speci cation languages and veri cation tools not speci cally developed for the analysis of cryptographic protocols. In t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008